New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages

نویسندگان

  • Jorge Almeida
  • Ondrej Klíma
چکیده

In a recent paper we gave a counterexample to a longstanding conjecture concerning the characterization of regular languages of level 2 in the Straubing-Thérien concatenation hierarchy of star-free languages. In that paper a new upper bound for the corresponding pseudovariety of monoids was implicitly given. In this paper we show that it is decidable whether a given monoid belongs to the new upper bound. We also prove that this new upper bound is incomparable with the previous upper bound.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The omega-inequality problem for concatenation hierarchies of star-free languages

The problem considered in this paper is whether an inequality of ω-terms is valid in a given level of a concatenation hierarchy of star-free languages. The main result shows that this problem is decidable for all (integer and half) levels of the Straubing-Thérien hierarchy.

متن کامل

A counterexample to a conjecture concerning concatenation hierarchies

We give a counterexample to the conjecture which was originally formulated by Straubing in 1986 concerning a certain algebraic characterization of regular languages of level 2 in the Straubing-Thérien concatenation hierarchy of star-free languages.

متن کامل

The wreath product principle for ordered semigroups

Straubing’s wreath product principle provides a description of the languages recognized by the wreath product of two monoids. A similar principle for ordered semigroups is given in this paper. Applications to language theory extend standard results of the theory of varieties to positive varieties. They include a characterization of positive locally testable languages and syntactic descriptions ...

متن کامل

Concatenation Hierarchies and Forbidden Patterns

We make the following progress on the dot–depth problem: (1) We introduce classes CB n and CL n of starfree languages defined via forbidden patterns in finite automata. It is shown for all n 0 that CB n (CL n) contains level n + 1=2 of the dot–depth hierarchy (Straubing–Thérien hierarchy, resp.). Since we prove that CB n and CL n have decidable membership problems, this yields a lower bound alg...

متن کامل

Some results on the dot-depth hierarchy

In this paper we pursue the study of the decidability of the dot-depth hierarchy. We give an effective lower bound for the dot-depth of an aperiodic monoid. The main tool for this is the study of a certain operation on varieties of finite monoids in terms of Mal’cev product. We also prove the equality of two decidable varieties which were known to contain all dot-depth two monoids. Finally, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics & Theoretical Computer Science

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2010